/**
* @author AlbertDarren
* @contact 2563491540@qq.com
*/
#include <bits/stdc++.h>

using namespace std;
const int maxn=20,maxm=17;
char seqA[maxn+1]={0},seqB[maxm+1]={0};
int f[maxn+1][maxm+1]={0};
void lcs()
{
    for (int i=1;i<=maxn ;++i )
    {
        for (int j=1;j<=maxm ;++j )
        {
            if (seqA[i]==seqB[j])
            {
                f[i][j]=f[i-1][j-1]+1;
            }
            else
            {
                f[i][j]=max(f[i-1][j],f[i][j-1]);
            }
        }
    }
}
int main_22()
{
    srand((unsigned)time(0));
    char table[63]={0};
    for (int i=0;i<10 ;++i )
    {
        table[i]=i+'0';
    }
    for (int i=10;i<36 ;++i )
    {
        table[i]=i+55;
    }
    for (int i=36;i<62 ;++i )
    {
        table[i]=i+61;
    }
    printf("%s\n",table);
    for (int j=1;j<=maxn;++j )
    {
        seqA[j]=table[rand()%63];
    }
    for (int j=1;j<=maxm;++j )
    {
        seqB[j]=table[rand()%63];
    }
    printf("%s\n",seqA);
    printf("%s\n",seqB);
    return 0;
}
